Improved Analysis of Deterministic Load-Balancing Schemes
نویسندگان
چکیده
منابع مشابه
Deterministic Load-Balancing Schemes for Disk-Based Video-On-Demand Storage Servers
A video-on-demand (VOD) storage server is a parallel, storage-centric system used for playing a large number of relatively slow streams of compressed digitized video and audio concurrently. Data is read from disks in relatively large chunks, and is then “streamed” out onto a distribution network. The primary design goal is to maximize the ratio of the number of concurrent streams to system cost...
متن کاملOptimal and Alternating-Direction Load Balancing Schemes
We discuss iterative nearest neighbor load balancing schemes on processor networks which are represented by a cartesian product of graphs like e.g. tori or hypercubes. By the use of the Alternating-Direction Loadbalancing scheme, the number of load balance iterations decreases by a factor of 2 for this type of graphs. The resulting ow is analyzed theoretically and it can be very high for certai...
متن کاملcient Schemes for Nearest Neighbor Load Balancing
We design a general mathematical framework to analyze the properties of nearest neighbor balancing algorithms of the di usion type. Within this framework we develop a new optimal polynomial scheme (OPS) which we show to terminate within a nite number m of steps, where m only depends on the graph and not on the initial load distribution. We show that all existing di usion load balancing algorith...
متن کاملEfficient schemes for nearest neighbor load balancing
We design a general mathematical framework to analyze the properties of nearest neighbor balancing algorithms of the diusion type. Within this framework we develop a new Optimal Polynomial Scheme (OPS) which we show to terminate within a ®nite number m of steps, where m only depends on the graph and not on the initial load distribution. We show that all existing diusion load balancing algorit...
متن کاملImproved Strategies for Dynamic Load Balancing
work speeds of some LANs have exceeded 100 Mbits per second, thereby reducing the penalty of interprocessor communication. So, dispatching tasks from heavily loaded computers to lightly loaded ones to improve system performance is both logical and feasible.1 Researchers have proposed many techniques to allocate jobs dynamically in a LAN or multiprocessor system to improve performance. For simpl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2019
ISSN: 1549-6325,1549-6333
DOI: 10.1145/3282435